On the two-connected planar spanning subgraph polytope
نویسندگان
چکیده
منابع مشابه
New facets for the planar subgraph polytope
This paper describes certain facet classes for the planar subgraph polytope. These facets are extensions of Kuratowski facets and are of the form 2x(U)+x(E(G)\U) ≤ 2|U |+|E(G)\U | −2 where the edge set U varies and can be empty. Two of the new types of facets complete the class of extended subdivision facets, explored by Jünger and Mutzel. In addition, the other types of facets consist of a new...
متن کاملOn the Minimum Labelling Spanning bi-Connected Subgraph problem
We introduce the minimum labelling spanning bi-connected subgraph problem (MLSBP) replacing connectivity by bi-connectivity in the well known minimum labelling spanning tree problem (MLSTP). A graph is bi-connected if, for every two vertices, there are, at least, two vertex-disjoint paths joining them. The problem consists in finding the spanning bi-connected subgraph or block with minimum set ...
متن کاملA PTAS for the Minimum Cost 2-edge-Connected Spanning Subgraph in Planar Graphs
Suppose we are given a planar graph G with edge costs and we want to find a 2-edge-connected spanning subgraph of minimum cost. We present a polynomial time approximation scheme (PTAS) for this problem when the costs are uniform, or when the total cost of G is within a constant factor of the optimal.
متن کاملMinimum 2-Edge Connected Spanning Subgraph of Certain Interconnection Networks
Given an undirected graph, finding a minimum 2-edge connected spanning subgraph is NP-hard. We solve the problem for silicate network, brother cell and sierpiński gasket rhombus.
متن کاملStrongly Connected Spanning Subgraph for Almost Symmetric Networks
In the strongly connected spanning subgraph (SCSS) problem, the goal is to find a minimum weight spanning subgraph of a strongly connected directed graph that maintains the strong connectivity. In this paper, we consider the SCSS problem for two families of geometric directed graphs; t-spanners and symmetric disk graphs. Given a constant t ≥ 1, a directed graph G is a t-spanner of a set of poin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00087-5